Reasoning with Graph Operations
نویسندگان
چکیده
Problem solving is an analog to scientific method, wherein abduction and deduction operate in a cyclic fashion to generate and refine a series of hypotheses that purport to explain the observed data. Model Generative Reasoning implements this cycle through a family of operations on representations based on conceptual graphs. Specialize, the operator that implements abduction generates alternative hypotheses. Fragment removes potential incoherences from hypotheses, while preserving coherence with the observations. This is seen as a form of deduction with the aim of allowing more hypotheses to be generated in the next cycle. 1. Problem solving and noisy data In essence, problem solving is a two-part process. There is a data-driven side, where making observations, filtering them and generating hypotheses from them is important. There is also another side, that is more goal-driven; evaluation of hypotheses against new data can, and does lead to reformulation or even rejection of these hypotheses. Typically problem solving machines are good at the first but less so at the second part. Heuristic search enables this sort of efficient generation, leading to excellent systems for planning, where the prime aim is to reach some desired goal without interference from the environment (Chapman, 87). When, however, data are incomplete, incoherent (i.e. unexpected), or just irrelevant, such techniques will fail. In these difficult cases, what is needed is a principled way of handling noisy data. The gaps in incomplete data should be filled, the incoherencies removed and the irrelevancies ignored. We will present, in this paper, mechanisms for doing all of these, and place these mechanisms in a problem solving framework. In order to do this we will contrast our approach with that based on theorem proving. In particular the nonmonotonic approach to noisy data through the ATMS (Reiter and de Kleer, 87) can be seen as only solving one of the problems associated with noisy data: incoherence that presents itself through logical inconsistency.
منابع مشابه
Characteristics of Common Neighborhood Graph under Graph Operations and on Cayley Graphs
Let G(V;E) be a graph. The common neighborhood graph (congraph) of G is a graph with vertex set V , in which two vertices are adjacent if and only if they have a common neighbor in G. In this paper, we obtain characteristics of congraphs under graph operations; Graph :::::union:::::, Graph cartesian product, Graph tensor product, and Graph join, and relations between Cayley graphs and its c...
متن کاملApplications of some Graph Operations in Computing some Invariants of Chemical Graphs
In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.
متن کاملApplications of Graph Operations
In this paper, some applications of our earlier results in working with chemical graphs are presented.
متن کاملSome New Results On the Hosoya Polynomial of Graph Operations
The Wiener index is a graph invariant that has found extensive application in chemistry. In addition to that a generating function, which was called the Wiener polynomial, who’s derivate is a q-analog of the Wiener index was defined. In an article, Sagan, Yeh and Zhang in [The Wiener Polynomial of a graph, Int. J. Quantun Chem., 60 (1996), 959969] attained what graph operations do to the Wiene...
متن کاملOn exponential domination and graph operations
An exponential dominating set of graph $G = (V,E )$ is a subset $Ssubseteq V(G)$ such that $sum_{uin S}(1/2)^{overline{d}{(u,v)-1}}geq 1$ for every vertex $v$ in $V(G)-S$, where $overline{d}(u,v)$ is the distance between vertices $u in S$ and $v in V(G)-S$ in the graph $G -(S-{u})$. The exponential domination number, $gamma_{e}(G)$, is the smallest cardinality of an exponential dominating set....
متن کاملThe Conceptual Programming Environment, CP: Reasoning Representation using Graph Structures and Operations
The Conceptual Programming environment, CP, being developed at the Computing Research Laboratory (CRL), is a complete knowledge representation visual programming environment for use with both dynamic, open-world, problem solving (Weak) applications and static, closed-world, scientific analysis (strong) applications. CP is based upon a graphical methodology of visualization derived from John Sow...
متن کامل